Waiting-time approximations for cyclic-service systems with switchover times
نویسندگان
چکیده
منابع مشابه
Waiting-time Approximations for Cyclic-service Systems with Mixed Service Strategies
An approximation method for mean waiting times in cyclic-service systems with a mixture of exhaustive/ gated/ I-limited service strategies is presented. The method provides a unification and generalization of some known good approximations for single strategies. The results of an exact analysis of the two-queue case where one queue is served exhaustively and the other queue I-limited, support t...
متن کاملAn Approximation for Mean Waiting Times in Cyclic Server Systems with Nonexhaustive Service
The cyclic server system has been the subject of considerable research over the last few years. Interest in analyzing such systems has gained momentum due to their application in the performance analysis of token ring networks. In this paper we consider cyclic server systems with nonexhaustive service discipline. The performance measures of interest here are the mean waiting times at the nodes ...
متن کاملWaiting times in polling systems with various service disciplines
We consider a polling system of N queues Q1, . . . , QN , cyclically visited by a single server. Customers arrive at these queues according to independent Poisson processes, requiring generally distributed service times. When the server visits Qi, i = 1, . . . , N , it serves a number of customers according to a certain visit discipline. This discipline is assumed to belong to the class of bran...
متن کاملClosed-Form Waiting Time Approximations for Polling Systems
A typical polling system consists of a number of queues, attended by a single server in a fixed order. The vast majority of papers on polling systems focusses on Poisson arrivals, whereas very few results are available for general arrivals. The current study is the first one presenting simple closed-form approximations for the mean waiting times in polling systems with renewal arrival processes...
متن کاملCyclic Queueing Networks with Subexponential Service Times
For a K-stage cyclic queueing network with N customers and general service times we provide bounds on the n departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service time distribution is subexponential.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Performance Evaluation
سال: 1987
ISSN: 0166-5316
DOI: 10.1016/0166-5316(87)90015-0